#include <bits/stdc++.h>
#define ll long long int
using namespace std;
void solve() {
int n;
cin>>n;
int sum=0, odd=INT_MAX, even=INT_MAX;
for(int i=0; i<n; i++) {
int val;
cin>>val;
sum+=val;
if(val&1) {
int cnt=0;
while(val&1) {
// cout<<val<<endl;
val/=2;
cnt++;
}
odd=min(odd, cnt);
}
else {
int cnt=0;
while(!(val&1)) {
val/=2;
cnt++;
}
even=min(even, cnt);
}
}
// cout<<"&"<<sum<<endl;
if(sum%2==0)
cout<<0<<endl;
else
cout<<min(odd, even)<<endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t; cin>>t; while(t--)
solve();
return 0;
}
236A - Boy or Girl | 271A - Beautiful Year |
520B - Two Buttons | 231A - Team |
479C - Exams | 1030A - In Search of an Easy Problem |
158A - Next Round | 71A - Way Too Long Words |
160A - Twins | 1A - Theatre Square |
1614B - Divan and a New Project | 791A - Bear and Big Brother |
1452A - Robot Program | 344A - Magnets |
96A - Football | 702B - Powers of Two |
1036A - Function Height | 443A - Anton and Letters |
1478B - Nezzar and Lucky Number | 228A - Is your horseshoe on the other hoof |
122A - Lucky Division | 1611C - Polycarp Recovers the Permutation |
432A - Choosing Teams | 758A - Holiday Of Equality |
1650C - Weight of the System of Nested Segments | 1097A - Gennady and a Card Game |
248A - Cupboards | 1641A - Great Sequence |
1537A - Arithmetic Array | 1370A - Maximum GCD |